Fault-Tolerant Distributed Match-Making with Weights - Parallel and Distributed Systems, 1996. Proceedings., 1996 International Conference on

Protocols to solve several distributed issues, such as name service, mutual exclusion, and creation of an atomic shared register, require two types of subsets with intersection property. Distributed matchmaking provides a method of creating the subsets, and the lower bound of the number of messages t o solve the issues. This paper discusses the fault-tolerant and weighted case, in which a protocol is fault-tolerant regarding node failures, and in which weights of subsets are different. The paper j r s t provides the lower bound of the number of messages required for a protocol in a general f o rm. Then, it concentrates a symmetric case and shows the lower bound in a simpler form. The paper also provides a method of constructing the t w o types of subsets, which realize the lower bound. It first shows a method f o r a fully symmetric case, and extends it for other cases. The extended method is prac tical. It creates a cyclic communication structure; and is valid for a n y degree of fault-tolerance and wezghts.